Shapley Feature Selection

نویسندگان

چکیده

Feature selection is a popular topic. The main approaches to deal with it fall into the three categories of filters, wrappers and embedded methods. Advancement in algorithms, though proving fruitful, may be not enough. We propose integrate an explainable AI approach, based on Shapley values, provide more accurate information for feature selection. test our proposal real setting, which concerns prediction probability default Small Medium Enterprises. Our results show that integrated approach indeed prove fruitful some methods, particular parsimonious ones like LASSO. In general combination seems useful algorithm can improve their performance with.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feature Selection Based on the Shapley Value

We present and study the Contribution-Selection algorithm (CSA), a novel algorithm for feature selection. The algorithm is based on the Multiperturbation Shapley Analysis, a framework which relies on game theory to estimate usefulness. The algorithm iteratively estimates the usefulness of features and selects them accordingly, using either forward selection or backward elimination. Empirical co...

متن کامل

A New Framework for Distributed Multivariate Feature Selection

Feature selection is considered as an important issue in classification domain. Selecting a good feature through maximum relevance criterion to class label and minimum redundancy among features affect improving the classification accuracy. However, most current feature selection algorithms just work with the centralized methods. In this paper, we suggest a distributed version of the mRMR featu...

متن کامل

Shapley meets Shapley

This paper concerns the analysis of the Shapley value in matching games. Matching games constitute a fundamental class of cooperative games which help understand and model auctions and assignments. In a matching game, the value of a coalition of vertices is the weight of the maximum size matching in the subgraph induced by the coalition. The Shapley value is one of the most important solution c...

متن کامل

Feature Selection

Data dimensionality is growing exponentially, which poses challenges to the vast majority of existing mining and learning algorithms, such as the curse of dimensionality, large storage requirement, and high computational cost. Feature selection has been proven to be an effective and efficient way to prepare high dimensional data for data mining and machine learning. The recent emergence of nove...

متن کامل

Feature Selection

Many scientific disciplines use modelling and simulation processes and techniques in order to implement non-linear mapping between the input and the output variables for a given system under study. Any variable that helps to solve the problem may be considered as input. Ideally, any classifier or regressor should be able to detect important features and discard irrelevant features, and conseque...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: FinTech

سال: 2022

ISSN: ['2674-1032']

DOI: https://doi.org/10.3390/fintech1010006